📚 node [[centroid|centroid]]
Welcome! Nobody has contributed anything to 'centroid|centroid' yet. You can:
-
Write something in the document below!
- There is at least one public document in every node in the Agora. Whatever you write in it will be integrated and made available for the next visitor to read and edit.
- Write to the Agora from social media.
-
Sign up as a full Agora user.
- As a full user you will be able to contribute your personal notes and resources directly to this knowledge commons. Some setup required :)
⥅ related node [[centroid based_clustering]]
⥅ related node [[centroid]]
⥅ node [[centroid]] pulled by Agora
📓
garden/KGBicheno/Artificial Intelligence/Introduction to AI/Week 3 - Introduction/Definitions/Centroid.md by @KGBicheno
centroid
Go back to the [[AI Glossary]]
The center of a cluster as determined by a k-means or k-median algorithm. For instance, if k is 3, then the k-means or k-median algorithm finds 3 centroids.
⥅ node [[centroid-based_clustering]] pulled by Agora
📓
garden/KGBicheno/Artificial Intelligence/Introduction to AI/Week 3 - Introduction/Definitions/Centroid-Based_Clustering.md by @KGBicheno
centroid-based clustering
Go back to the [[AI Glossary]]
A category of clustering algorithms that organizes data into nonhierarchical clusters. k-means is the most widely used centroid-based clustering algorithm.
Contrast with hierarchical clustering algorithms.
📖 stoas
- public document at doc.anagora.org/centroid|centroid
- video call at meet.jit.si/centroid|centroid
🔎 full text search for 'centroid|centroid'